Application of Polynomial Algorithms to a Random Elastic Medium

نویسنده

  • Chen Zeng
چکیده

A randomly pinned elastic medium in two dimensions is modeled by a disordered fully-packed loop model. The energetics of disorderinduced dislocations is studied using exact and polynomial algorithms from combinatorial optimization. Dislocations are found to become unbound at large scale, and the elastic phase is thus unstable giving evidence for the absence of a Bragg glass in two dimensions. Randomly pinned elastic media are used to model various condensedmatter systems with quenched disorder including the vortex phase of dirty type-II superconductors[1]. Much analytical progress on these systems has been made within the elastic approximation where dislocations are excluded by fiat. The intriguing possibility of spontaneous formation of disorderinduced dislocations (pairs and loops respectively in two and three dimensions) at large scale, however, remains a challenging question[2]. To address this issue at zero temperature requires a detailed understanding of the energetics of dislocations in terms of their elastic-energy cost and disorder-energy gain in the ground stateBG. In recent years, we have witnessed a fruitful exploration of novel algorithms in for complex disordered systems whose ground state itself is dominated by random disorder. One class of these efficient algorithms is based on network flow optimization. It includes the min-cost-flow, max-flow and matching algorithms which compute the exact ground state in time that grows only polynomialy in the system size, an attibution of great practical importance. Some recent applications include studies of the roughness and topography of random manifolds and 2d random elastic media by max-flow[3], matching[4] and min-cost-flow algorithms[5], the sensitivity exponents of the random-field-Ising model by max-flow algorithms[6], the domain-wall energy in the gauge glass by min-cost-flow algorithms[7],

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

Boundary Value Problems in Generalized Thermodiffusive Elastic Medium

In the present study, the boundary value problems in generalized thermodiffusive elastic medium has been investigated as a result of inclined load. The inclined load is assumed to be a linear combination of normal load and tangential load. Laplace transform with respect to time variable and Fourier transform with respect to space variable are applied to solve the problem. As an application of t...

متن کامل

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

متن کامل

Comparison of 14 different families of classification algorithms on 115 binary datasets

We tested 14 very different classification algorithms (random forest, gradient boosting machines, SVM linear, polynomial, and RBF 1-hidden-layer neural nets, extreme learning machines, k-nearest neighbors and a bagging of knn, naive Bayes, learning vector quantization, elastic net logistic regression, sparse linear discriminant analysis, and a boosting of linear classifiers) on 115 real life bi...

متن کامل

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008